/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
const ll maxn = 1e5 + 100;
ll n, m;
ll mp[maxn];
int main()
{
    IOS;
    cin >> n;
    for (ll i = 1; i <= n; i++)
    {
        ll x;
        cin >> x;
        mp[x] = i;
    }
    cin >> m;
    ll sum1 = 0, sum2 = 0;
    for (ll i = 1; i <= m; i++)
    {
        ll x;
        cin >> x;
        sum1 += mp[x];
        sum2 += n - mp[x] + 1;
    }
    cout << sum1 << " " << sum2 << endl;
    getchar();
    getchar();
    return 0;
}
